R–LINE: A better randomized 2-server algorithm on the line
نویسندگان
چکیده
منابع مشابه
R-LINE: A Better Randomized 2-Server Algorithm on the Line
Article history: Received 7 April 2015 Received in revised form 26 August 2015 Accepted 31 August 2015 Available online 3 September 2015 Communicated by D.-Z. Du
متن کاملA randomized on-line algorithm for the k-server problem on a line
We give a O(n 2 3 logn)–competitive randomized k–server algorithm when the underlying metric space is given by n equally spaced points on a line. For n = k+o(k 3 2/ log k), this algorithm is o(k)–competitive.
متن کاملA Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem
We present a lower bound of 1+e ?1=2 1:6065 on the competitive ratio of randomized algorithms for the weighted 2-cache problem, which is a special case of the 2-server problem. This improves the previously best known lower bound of e=(e ? 1) 1:582 for both problems.
متن کاملRandomized algorithm for the k-server problem on decomposable spaces
We study the randomized k-server problem on metric spaces consisting of widely separated subspaces. We give a method which extends existing algorithms to larger spaces with the growth rate of the competitive quotients being at most O(log k). This method yields o(k)-competitive algorithms solving the randomized k-server problem, for some special underlying metric spaces, e.g. HSTs of"small"heigh...
متن کاملM ay 2 00 7 A randomized algorithm for the on - line weighted bipartite matching problem ∗
We study the on-line minimum weighted bipartite matching problem in arbitrary metric spaces. Here, n not necessary disjoint points of a metric space M are given, and are to be matched on-line with n points of M revealed one by one. The cost of a matching is the sum of the distances of the matched points, and the goal is to find or approximate its minimum. The competitive ratio of the determinis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.08.043